منابع مشابه
Thinning Out Redundant Empirical Data
Given a set X of “empirical” points, whose coordinates are perturbed by errors, we analyze whether it contains redundant information, that is whether some of its elements could be represented by a single equivalent point. If this is the case, the empirical information associated to X could be described by fewer points, chosen in a suitable way. We present two different methods to reduce the car...
متن کاملReducing Trials by Thinning-Out in Skill Discovery
In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improve discovering results, in the same way as “pruning” in a search tree. We show that our thinningout technique significantly reduces the number of trials. In addition, we apply thinning-out to the discovery of good phys...
متن کاملThinning out Steiner trees: a node-based model for uniform edge costs
The Steiner Tree Problem is a challenging NP-hard problem. Many hard instances of this problem are publicly available, that are still unsolved by state-of-the-art branch-and-cut codes. A typical strategy to attack these instances is to enrich the polyhedral description of the problem, and/or to implement more and more sophisticated separation procedures and branching strategies. In this paper w...
متن کاملAn Improved order independent parallel thinning algorithm for Image thinning
This paper addresses an order-independent parallel thinning algorithm. This algorithm is a two-pass, iterative and parallel processing. In pass-1 the entire image is thinned uniformly to two-pixel thick. In pass-2 the two-pixel thick image is further thinned to one pixel thick image without leaving any two pixels in the resultant image. The thinning process is based on weight-values. The weight...
متن کاملThe Thinning Problem
The main problem addressed in this work is how to confine the set of sequential processes of a disjunctive / conjunctive resource allocation system (D/C-RAS) to a subset of their feasible behaviors while optimizing some performance criterion. We provide a canonical characterization of this problem in the form of a Mixed Integer Programming (MIP) formulation, for the case that the optimized perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Climate Change
سال: 2008
ISSN: 1758-678X,1758-6798
DOI: 10.1038/climate.2008.136